A New Priority Rule for Initial Ordering of Jobs in Permutation Flowshop Scheduling Problems

Scheduling in a permutation flowshop refers to processing of jobs set available machines the same order. Among several possible performance characteristics flowshop, makespan remains one highest preferred metrics by researchers past six decades. The constructive heuristic proposed Nawaz-Enscore-Ham (NEH) is best for minimization. essentially depends on initial ordering according particular priority rule (PR). popular rules are non-increasing order jobs' total time, sum average time and standard deviation and, absolute skewness among others. objective this paper propose analyse new job flowshop. literature studied rules; slightly modified, replacing mean (MAD). To assess rule, four benchmark datasets used. computational results statistical analyses demonstrate better rule.